首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1560篇
  免费   57篇
  国内免费   5篇
工业技术   1622篇
  2023年   10篇
  2022年   16篇
  2021年   48篇
  2020年   37篇
  2019年   36篇
  2018年   48篇
  2017年   49篇
  2016年   48篇
  2015年   42篇
  2014年   46篇
  2013年   110篇
  2012年   52篇
  2011年   78篇
  2010年   53篇
  2009年   61篇
  2008年   87篇
  2007年   65篇
  2006年   42篇
  2005年   55篇
  2004年   38篇
  2003年   27篇
  2002年   28篇
  2001年   18篇
  2000年   19篇
  1999年   21篇
  1998年   56篇
  1997年   41篇
  1996年   42篇
  1995年   27篇
  1994年   27篇
  1993年   27篇
  1992年   24篇
  1991年   21篇
  1990年   18篇
  1989年   14篇
  1988年   13篇
  1987年   13篇
  1986年   11篇
  1985年   10篇
  1984年   16篇
  1983年   18篇
  1982年   7篇
  1981年   9篇
  1979年   8篇
  1978年   10篇
  1977年   13篇
  1976年   14篇
  1974年   9篇
  1973年   8篇
  1972年   6篇
排序方式: 共有1622条查询结果,搜索用时 15 毫秒
21.
When a jet of soluble gas is directed on to liquid surface, the kinetic energy of the jet is transferred to the liquid giving rise to circulation, which in turn enhances mass transfer. Consequently, the mass transfer coefficient is related to the characteristics of the jet.  相似文献   
22.
Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NPco-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.  相似文献   
23.
Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.  相似文献   
24.
We review herein the key mechanistic and kinetic features of the reactions involved in the NH3-NO/NO2 SCR system investigated by dynamic reactive experiments over a V-based commercial powdered catalyst, eventually leading to the proposal of an original redox scheme which accounts for stoichiometry, selectivity and intrinsic kinetics of the global SCR process.  相似文献   
25.
Uma Chatterjee 《Polymer》2005,46(5):1575-1582
ATRP of several methacrylates viz. methyl methacrylate (MMA), ethyl methacrylate (EMA), n-butyl methacrylate (nBMA), t-butyl methacrylate (tBMA), benzyl methacrylate (BzMA) and (N,N-dimethylamino)ethyl methacrylate (DMAEMA) has been studied in neat as well as aqueous (up to 12 vol% water) acetone at 35 °C using CuCl/bipyridine (bpy) catalyst and ethyl 2-bromoisobutyrate as the initiator. Addition of water significantly enhances the rate of polymerization without losing control. Unlike CuCl/bpy the CuBr/bpy catalyst gives poor control which is attributed to the lower solubility and consequent heterogeneity in the latter case. Of the other ligands used with the CuCl catalyst viz. o-phenanthroline (o-phen), 1,1,4,7,7-pentamethyldiethylenetriamine (PMDETA), 1,1,4,7,10,10-hexamethyltriethylenetetramine (HMTETA), Me6TREN only o-phen offers reasonably good control. The CuCl/bpy catalyst system has been used also in preparing some di- and tri-block copolymers with reasonably low polydispersity index (PDI) at ambient temperature (35 °C) using aqueous acetone as the solvent. The following block copolymers have been prepared PMMA-tBMA, PMMA-b-tBMA-b-MMA, PMMA-DMAEMA, by this method.  相似文献   
26.
Nanocrystalline La0.9Sr0.1Al0.85Co0.05Mg0.1O3 oxide powder was synthesized by a citrate–nitrate auto-ignition process and characterized by thermal analysis, X-ray diffraction, and impedance spectroscopy measurements. Nanocrystalline (50–100 nm) powder with perovskite structure could be produced at 900°C by this process. The powder could be sintered to a density more than 96% of the theoretical density at 1550°C. Impedance measurements on the sintered samples unequivocally established the potential of this process in developing nanostructured lanthanum aluminate-based oxides. The sintered La0.9Sr0.1Al0.85Co0.05Mg0.1O3 sample exhibited a conductivity of 2.40 × 10−2 S/cm in air at 1000°C compared with 4.9 × 10−3 S/cm exhibited by La0.9Sr0.1Al0.85Mg0.15O3.  相似文献   
27.
Multibody System Dynamics - Collision between hard objects causes abrupt changes in the velocities of the system, which are characterized by very large contact forces over very small time...  相似文献   
28.
Machinability of a nickel aluminide intermetallic alloy   总被引:3,自引:0,他引:3  
This article reports the results of an experimental study on the machinability of a nickel aluminide intermetallic alloy. Machining was conducted at various speeds, and results indicate low material removal rates. Chips collected for each test run were measured for thickness for shear angle calculation and were subsequently observed microscopically. Chip segmentation was observed microscopically, and a fluctuation in the shear angle was evidenced. A parameter characterizing the severity of the machining process, the chip reduction coefficient (K), was calculated from chip thickness measurements. The calculated values ofK were found to be low, indicating a low severity of the metalcutting process. This, however, is in contract with the observed low rates of metal removal and low tool life. Thus, conventional metalcutting characterization parameters require re- examination in terms of machining high-strength materials.  相似文献   
29.
The effects of silicon on the properties of tantalum   总被引:2,自引:0,他引:2  
The microalloying of tantalum with silicon has been effectively used on a commercial scale. However, data on effects of microalloying on processibility, microstructure and mechanical properties are not readily available. To develop some data, tantalum powder with various levels of silicon (0–50 ppm) was processed under identical conditions. Sheet samples were then annealed at different temperatures and evaluated via microstructural, chemical and mechanical tests. The recrystallization temperature was found to increase with silicon content, most probably as a result of the presence of an intermetallic (Ta3Si) phase. The mechanical properties of unrecrystallized tantalum are, as expected, significantly different from those of recrystallized tantalum.  相似文献   
30.
Estimation of reliability and the number of faults present in software in its early development phase, i.e., requirement analysis or design phase is very beneficial for developing reliable software with optimal cost. Software reliability prediction in early phase of development is highly desirable to the stake holders, software developers, managers and end users. Since, the failure data are unavailable in early phase of software development, different reliability relevant software metrics and similar project data are used to develop models for early software fault prediction. The proposed model uses the linguistic values of software metrics in fuzzy inference system to predict the total number of faults present in software in its requirement analysis phase. Considering specific target reliability, weightage of each input software metrics and size of software, an algorithm has been proposed here for developing general fuzzy rule base. For model validation of the proposed model, 20 real software project data have been used here. The linguistic values from four software metrics related to requirement analysis phase have been considered as model inputs. The performance of the proposed model has been compared with two existing early software fault prediction models.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号